Cropping-Resilient Segmented Multiple Watermarking

نویسندگان

  • Keith B. Frikken
  • Mikhail J. Atallah
چکیده

Watermarking is a frequently used tool for digital rights management. An example of this is using watermarks to place ownership information into an object. There are many instances where placing multiple watermarks into the same object is desired. One mechanism that has been proposed for doing this is segmenting the data into a grid and placing watermarks into different regions of the grid. This is particularly suited for images and geographic information systems (GIS) databases as they already consist of a fine granularity grid (of pixels, geographic regions, etc.); a grid cell for watermarking is an aggregation of the original fine granularity cells. An attacker may be interested in only a subset of the watermarked data, and it is crucial that the watermarks survive in the subset selected by the attacker. In the kind of data mentioned above (images, GIS, etc.) such an attack typically consists of cropping, e.g. selecting a geographic region between two latitudes and longitudes (in the GIS case) or a rectangular region of pixels (in an image). The contribution of this paper is a set of schemes and their analysis for multiple watermark placement that maximizes resilience to the above mentioned cropping attack. This involves the definition of various performance metrics and their use in evaluating and comparing various placement schemes.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Performance Measurement of Watermark Embedding Patterns

Segmented watermarking is an approach to multiple watermarking that can be used to acknowledge the contribution of multiple authors or to embed a fingerprint code-word, but is susceptible to cropping attacks that discard portions of the watermarked media. Careful selection of the watermark embedding pattern can increase the resilence of a segmented watermark in the presence of cropping attacks....

متن کامل

Weighted Segmented Digital Watermarking

We introduce the notion of weighted watermarking for proof-of-ownership watermark protection of multimedia works that are the product of more than one author and where each author is considered to be of different importance relative to the other authors. We specifically examine weighted segmented watermarking for still images and generalise previous work on performance measurement of watermark ...

متن کامل

Robust Public Key Watermarking of Digital Images

robust, watermarking, invisible This paper addresses the problem of watermarking a digital image, in order to detect or verify ownership. An invisible and resilient watermark is one that is not ordinarily visible and is robust in the face of common image manipulations such as lossy compression, scaling, cropping, rotation, reflection, and brightness/contrast adjustment. A watermarking scheme is...

متن کامل

A Practical Print-and-Scan Resilient Watermarking for High Resolution Images

Detecting the watermark from the rescanned image is still a challenging problem, especially for high resolution image. After printing and scanning, an image usually suffers global geometric distorts ( such as rotation, scaling, translation and cropping), local random nonlinear geometric distortions which is simulated in Random Bending function of Stirmark, as well as nonlinear pixel value disto...

متن کامل

A Rough Geometric-Distortion Resilient Watermarking Algorithm Using Fuzzy C-Means Clustering of SURF Points

SURF Points, Fuzzy C-Means Clustering, Delaunay Triangulation, Rough Geometric Distortion, Watermarking. In recent times, due to great developments in computer and internet technology, multimedia data i.e. images, audio and video have found wide applications. Digital watermarking is one of the best solutions to prevent illegal copying, modifying and redistributing multimedia data. Robustness is...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003